Some Experimental Results with Tree Adjunct Grammar Guided Genetic Programming
نویسندگان
چکیده
Tree-adjunct grammar guided genetic programming (TAG3P) [5] is a grammar guided genetic programming system that uses context-free grammars along with tree-adjunct grammars as means to set language bias for the genetic programming system. In this paper, we show the experimental results of TAG3P on two problems: symbolic regression and trigonometric identity discovery. The results show that TAG3P works well on those problems.
منابع مشابه
A Framework For Tree-Adjunct Grammar Guided Genetic Programming
In this paper we propose the framework for a grammar-guided genetic programming system called Tree-Adjunct Grammar Guided Genetic Programming (TAGGGP). Some intuitively promising aspects of the model compared with other grammar-guided evolutionary methods are also highlighted. 1 Introduction Genetic programming (GP) is considered to be a machine learning method, which induces a population of co...
متن کاملSolving the Symbolic Regression Problem with Tree-Adjunct Grammar Guided Genetic Programming: The Comparative Results
In this paper, we show some experimental results of tree-adjunct grammar guided genetic programming [6] (TAG3P) on the symbolic regression problem, a benchmark problem in genetic programming. We compare the results with genetic programming [9] (GP) and grammar guided genetic programming [14] (GGGP). The results show that TAG3P significantly outperforms GP and GGGP on the target functions attemp...
متن کاملSolving Trigonometric Identities with Tree Adjunct Grammar Guided Genetic Programming
Genetic programming (GP) may be seen as a machine learning method, which induces a population of computer programs by evolutionary means (Banzhaf et al. 1998). Genetic programming has been used successfully in generating computer programs for solving a number of problems in a wide range of areas. In (Hoai and McKay 2001), we proposed a framework for a grammar-guided genetic programming system c...
متن کاملCan Tree Adjunct Grammar Guided Genetic Programming be Good at Finding a Needle In a Haystack? A Case Study
In this paper we experiment TAG3P on the even parity problems in order to investigate the robustness of tree-adjunct grammar guided genetic programming [3] (TAG3P) on the problems classified as “finding a needle in a haystack” [9]. We compare the result with grammar guided genetic programming [15] (GGGP) and genetic programming [7] (GP). The results show that TAG3P does not work well on the pro...
متن کاملToward an Alternative Comparison between Different Genetic Programming Systems
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and separate out the effects of different search space sizes and search algorithms. Experimental results are given, comparing the performance and search behavior of Tree Adjoining Grammar Guided Genetic Programming (TAG3P) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002